Cost and makespan-aware workflow scheduling in hybrid clouds
نویسندگان
چکیده
منابع مشابه
Resource-efficient workflow scheduling in clouds
Workflow applications in science and engineering have steadily increased in variety and scale. Coinciding with this increase has been the relentless effort to improve the performance of these applications through exploiting the abundance of resources in hyper-scale clouds and with little attention to resources efficiency. The inefficient use of resources when executing scientific workflows resu...
متن کاملSurvivability and Makespan Driven Scheduling Algorithm for Grid Workflow Applications
With the development of Grid technologies, scientists and engineers obtain large computing capability to execute large-scale workflow applications. However the Grids also bring a troublesome problem. In the dynamic, complex and unbounded Grid systems, malicious attacks and hardware faults, which are inevitable, can have a serious effect on the execution of applications. Therefore it is necessar...
متن کاملA Clustering Approach to Scientific Workflow Scheduling on the Cloud with Deadline and Cost Constraints
One of the main features of High Throughput Computing systems is the availability of high power processing resources. Cloud Computing systems can offer these features through concepts like Pay-Per-Use and Quality of Service (QoS) over the Internet. Many applications in Cloud computing are represented by workflows. Quality of Service is one of the most important challenges in the context of sche...
متن کاملRisk-Aware Data Processing in Hybrid Clouds
This paper explores query processing in a hybrid cloud model where a user’s local computing capability is exploited alongside public cloud services to deliver an efficient and secure data management solution. Hybrid clouds offer numerous economic advantages including the ability to better manage data privacy and confidentiality, as well as exerting control on monetary expenses of consuming clou...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Systems Architecture
سال: 2019
ISSN: 1383-7621
DOI: 10.1016/j.sysarc.2019.08.004